A Sundaram type Bijection for SO(3): Vacillating Tableaux and Pairs of Standard Young Tableaux and Orthogonal Littlewood-Richardson Tableaux

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bijection between Littlewood-richardson Tableaux and Rigged Configurations

We define a bijection from Littlewood–Richardson tableaux to rigged configurations and show that it preserves the appropriate statistics. This proves in particular a quasi-particle expression for the generalized Kostka polynomials KλR(q) labeled by a partition λ and a sequence of rectangles R. The generalized Kostka polynomials are q-analogues of multiplicities of the irreducible GL(n,C)-module...

متن کامل

Equivariant Littlewood-richardson Skew Tableaux

We give a positive equivariant Littlewood-Richardson rule also discovered independently by Molev. Our proof generalizes a proof by Stembridge of the ordinary Littlewood-Richardson rule. We describe a weight-preserving bijection between our indexing tableaux and the Knutson-Tao puzzles.

متن کامل

A Cyclage Poset Structure for Littlewood-Richardson Tableaux

A graded poset structure is defined for the sets of LittlewoodRichardson (LR) tableaux that count the multiplicity of an irreducible gl(n)module in the tensor product of irreducible gl(n)-modules corresponding to rectangular partitions. This poset generalizes the cyclage poset on columnstrict tableaux defined by Lascoux and Schützenberger, and its grading function generalizes the charge statist...

متن کامل

A bijection between Proctor's and Sundaram's odd orthogonal tableaux

An explicit bijection between Proctor's odd orthogonal tableaux and Sundaram's odd orthogonal tableaux is given.

متن کامل

Polygon Dissections and Standard Young Tableaux

A simple bijection is given between dissections of a convex n gon with d diagonals not intersecting in their interiors and standard Young tableaux of shape d d n d Partially supported by National Science Foundation grant DMS For d n let f n d be the number of ways to draw d diagonals in a convex n gon such that no two diagonals intersect in their interior For instance f n n is just the Catalan ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2018

ISSN: 1077-8926

DOI: 10.37236/7713